package com.xiongda;

import java.util.HashSet;
import java.util.Set;

public class LeetCode3 {

    static class Solution {
        public static int lengthOfLongestSubstring(String s) {
            int n = s.length();
            Set<Character> set = new HashSet<>();
            /*for (int i = 0,j = 0; i < n && j < n; j++) {

            }*/
            return 0;
        }
    }

    public static void main(String[] args) {
        String[] strings = {"abcabcbb", "bbbbb", "pwwkew"};
        for (String string : strings) {
            int len = Solution.lengthOfLongestSubstring(string);
            System.out.println(len);
        }
    }
}
